intuitionistic logic - definição. O que é intuitionistic logic. Significado, conceito
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

O que (quem) é intuitionistic logic - definição

VARIOUS SYSTEMS OF SYMBOLIC LOGIC
Constructivist logic; Constructive logic; Intuitionist logic; Intuitionistic propositional calculus; Intuitionistic Prop Calc; Intuitionistic Logic; Semantics of intuitionistic logic; Semantics for intuitionistic logic
  • The [[Rieger–Nishimura lattice]]. Its nodes are the propositional formulas in one variable up to intuitionistic [[logical equivalence]], ordered by intuitionistic logical implication.

intuitionist logic         
<spelling> Incorrect term for "intuitionistic logic". (1999-11-24)
intuitionistic logic         
<logic, mathematics> Brouwer's foundational theory of mathematics which says that you should not count a proof of (There exists x such that P(x)) valid unless the proof actually gives a method of constructing such an x. Similarly, a proof of (A or B) is valid only if it actually exhibits either a proof of A or a proof of B. In intuitionism, you cannot in general assert the statement (A or not-A) (the principle of the excluded middle); (A or not-A) is not proven unless you have a proof of A or a proof of not-A. If A happens to be undecidable in your system (some things certainly will be), then there will be no proof of (A or not-A). This is pretty annoying; some kinds of perfectly healthy-looking examples of proof by contradiction just stop working. Of course, excluded middle is a theorem of classical logic (i.e. non-intuitionistic logic). {History (http://britanica.com/bcom/eb/article/3/0,5716,118173+14+109826,00.html)}. (2001-03-18)
Intuitionistic logic         
Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of intuitionistic logic do not include the law of the excluded middle and double negation elimination, which are fundamental inference rules in classical logic.

Wikipédia

Intuitionistic logic

Intuitionistic logic, sometimes more generally called constructive logic, refers to systems of symbolic logic that differ from the systems used for classical logic by more closely mirroring the notion of constructive proof. In particular, systems of intuitionistic logic do not assume the law of the excluded middle and double negation elimination, which are fundamental inference rules in classical logic.

Formalized intuitionistic logic was originally developed by Arend Heyting to provide a formal basis for L. E. J. Brouwer's programme of intuitionism. From a proof-theoretic perspective, Heyting’s calculus is a restriction of classical logic in which the law of excluded middle and double negation elimination have been removed. Excluded middle and double negation elimination can still be proved for some propositions on a case by case basis, however, but do not hold universally as they do with classical logic. The standard explanation of intuitionistic logic is the BHK interpretation.

Several systems of semantics for intuitionistic logic have been studied. One of these semantics mirrors classical Boolean-valued semantics but uses Heyting algebras in place of Boolean algebras. Another semantics uses Kripke models. These, however, are technical means for studying Heyting’s deductive system rather than formalizations of Brouwer’s original informal semantic intuitions. Semantical systems claiming to capture such intuitions, due to offering meaningful concepts of “constructive truth” (rather than merely validity or provability), are Kurt Gödel’s dialectica interpretation, Stephen Cole Kleene’s realizability, Yurii Medvedev’s logic of finite problems, or Giorgi Japaridze’s computability logic. Yet such semantics persistently induce logics properly stronger than Heyting’s logic. Some authors have argued that this might be an indication of inadequacy of Heyting’s calculus itself, deeming the latter incomplete as a constructive logic.